A k-total coloring of a graph G is a map σ: V (G)∪E(G)→{1,2,...,k} such that no two adjacent or incident elements......

需要适当地渲染图 G 的顶点和边的颜色的最小的数字被称为 G 的全部的色彩的数字并且由(G) 表示了。平面图 G 是否有最大的度，被看......

Let G be a graph which can be embedded in a surface of nonnegative Euler characteristic.In this paper,it is proved that ......